Generalizing empirical adequacy II: partial structures
نویسندگان
چکیده
منابع مشابه
Generalizing empirical adequacy I: multiplicity and approximation
I provide an explicit formulation of empirical adequacy, the central concept of constructive empiricism, and point out a number of problems. Based on one of the inspirations for empirical adequacy, I generalize the notion of a theory to avoid implausible presumptions about the relation of theoretical concepts and observations, and generalize empirical adequacy with the help of approximation set...
متن کاملEmpirical Adequacy and Ramsification
Structural realism has been proposed as an epistemological position interpolating between realism and sceptical anti-realism about scientific theories. The structural realist who accepts a scientific theory Θ thinks that Θ is empirically correct, and furthermore is a realist about the ‘structural content’ of Θ. But what exactly is ‘structural content’? One proposal is that the ‘structural conte...
متن کاملAdequacy of Knowledge Management Structures
This study identifies the main elements of knowledge management structures and examines their effects on knowledge management adequacy and subsequently on knowledge management effectiveness. A path model representing the antecedents of knowledge management structure adequacy and the consequence on knowledge management effectiveness is developed and tested empirically based on a survey. The resu...
متن کاملGeneralizing Boolean Satisfiability II: Theory
This is the second of three planned papers describing zap, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying zap is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to def...
متن کاملGeneralizing Partial Order and Dynamic Backtracking
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB) and partial order dynamic backtracking (PDB) have been presented. These algorithms have the property to be additive on disjoint subproblems and yet use only polynomial space. Unlike DBFPDB only imposes a partial search order and therefore appears to have more freedom than DB to explore the search space. HoweverFboth algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2019
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-019-02121-z